Measures of Fault Tolerance in Distributed Simulated Annealing

نویسنده

  • Aaditya Prakash
چکیده

In this paper, we examine the different measures of Fault Tolerance in a Distributed Simulated Annealing process. Optimization by Simulated Annealing on a distributed system is prone to various sources of failure. We analyse simulated annealing algorithm, its architecture in distributed platform and potential sources of failures. We examine the behaviour of tolerant distributed system for optimization task. We present possible methods to overcome the failures and achieve fault tolerance for the distributed simulated annealing process. We also examine the implementation of Simulated Annealing in MapReduce system and possible ways to prevent failures in reaching the global optima. This paper will be beneficial to those who are interested in implementing a large scale distributed simulated annealing optimization problem of industrial or academic interest. We recommend hybrid tolerance technique to optimize the trade-off between efficiency and availability. Keywords— Simulated Annealing, Distributed Systems, Fault Tolerance, Optimization, MapReduce

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

General Applicability of Genetic and Simulated Annealing Algorithms for Data Mapping

We experimentally analyze the general applicability of genetic algorithms (GA) and simulated annealing algorithms (SA) for mapping data to multicomputers. The results show that the GA and SA are insensitive to user parameters in wide ranges, completely fault tolerant, and unbiased towards particular multicomputer topologies. These properties of flexibility and general applicability, which are l...

متن کامل

Reliability Optimization Models for Fault-Tolerant Distributed Systems

This paper presents four models to demonstrate our techniques for optimizing software and hardware reliability for fault-tolerant distributed systems. The models help us find the optimal system structure while considering basic information on reliability and cost of the available software and hardware components. Each model is suitable for a distinct set of conditions or situations. All four mo...

متن کامل

An occam-pi Implementation of a Verified Distributed Robust Annealing Algorithm

Significant additions have recently been made to the occam concurrent programming language. The new occam-π now supports, among other features, mobile channels, mobile processes, shared channels, and dynamic forking of new concurrent processes. These features should greatly enhance the ability of occam to precisely and easily implement complex concurrent applications. We have recently evaluated...

متن کامل

An occam-π Implementation of a Distributed Robust Annealing Algorithm

Significant additions have recently been made to the occam concurrent programming language. The new occam-π now supports, among other features, mobile channels, mobile processes, shared channels, and dynamic forking of new concurrent processes at run-time. These features should greatly enhance the ability of occam to precisely and easily implement complex concurrent applications. We have recent...

متن کامل

Numeric Multi-Objective Rule Mining Using Simulated Annealing Algorithm

Abstract as a single objective one. Measures like support, confidence and other interestingness criteria which are used for evaluating a rule, can be thought of as different objectives of association rule mining problem. Support count is the number of records, which satisfies all the conditions that exist in the rule. This objective represents the accuracy of the rules extracted from the da...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1212.3295  شماره 

صفحات  -

تاریخ انتشار 2012